Preliminary concepts, historical background, basic definitions for computational geometry. Discusses the basic algorithms of computational geometry. Basic data structures used to solve geometric problems. Characteristics and recording of geometric objects. Properties and use of vector product in computational geometry. Approximate objects with bounding rectangles and index spatial data. The
issue of the intersection of lines and sections. Geometric interpretation. Search in a set of intersecting pairs. Study the position of the point inside the polygon. Methods of solving the task - special cases. Create a convex wrapper of a set of points. Methods of solving the task. Finding a pair of the least distant points. Generalizing the shape of geometric objects. Create paths for surface objects. The issue of
the intersection of polygons. Voronoi diagram and its application. The problem of triangulation of a set of points. Delaunay triangulation
